Fair Π ?
نویسندگان
چکیده
In this paper, we define fair computations in the π-calculus [18]. We follow Costa and Stirling’s approach for CCS-like languages [9,10] but exploit a more natural labeling method of process actions to filter out unfair process executions. The new labeling allows us to prove all the significant properties of the original one, such as unicity, persistence and disappearance of labels. It also turns out that the labeled πcalculus is a conservative extension of the standard one. We contrast the existing fair testing [3,19] with those that naturally arise by imposing weak and strong fairness as defined by Costa and Stirling. This comparison provides the expressiveness of the various fair testing-based semantics and emphasizes the discriminating power of the one already proposed in the literature.
منابع مشابه
Parameterized complexity of fair deletion problems II
Vertex deletion problems are those where given a graph G and a graph property π, the goal is to find a subset of vertices W such that G \W satisfies property π. Typically, we want to minimize size of the deletion set W . Unlike this, in fair vertex deletion problems we change the objective: we minimize the maximum number of vertices deleted in neighborhood of any vertex. When the property π is ...
متن کاملReasoning About Systems with Transition Fairness
Formal verification methods model systems by Kripke structures. In order to model live behaviors of systems, Kripke structures are augmented with fairness conditions. Such conditions partition the computations of the systems into fair computations, with respect to which verification proceeds, and unfair computations, which are ignored. Reasoning about Kripke structures augmented with fairness i...
متن کاملPict Correctness Revisited
The Pict programming language is an implementation of the π-calculus in which executions of π-calculus terms are specified via an abstract machine. An important property of any concurrent programming language implementation is the fair execution of threads. After defining fairness for the π-calculus, we show that Pict abstract machine executions implement fair π-calculus executions. We also giv...
متن کاملJean - Sébastien Sereni ON FAIR EDGE DELETION PROBLEMS
In edge deletion problems, we are given a graph G and a graph property π and the task is to find a subset of edges the deletion of which results in a subgraph of G satisfying the property π. Typically the objective is to minimize the total number of deleted edges while in less common fair versions the objective is to minimize the maximum number of edges removed from a single vertex. We focus on...
متن کاملAn intensionally fully-abstract sheaf model for π (expanded version)
Following previous work on CCS, we propose a compositional model for the π-calculus in which processes are interpreted as sheaves on certain simple sites. Such sheaves are a concurrent form of innocent strategies, in the sense of Hyland-Ong/Nickau game semantics. We define an analogue of fair testing equivalence in the model and show that our interpretation is intensionally fully abstract for i...
متن کامل